نمایش نتایج جستجو برای
نویسنده: مصطفی نوری بایگی
موارد یافت شده: 9
1 - α-Visibility (چکیده)2 - Partial Visibility Polygon with Semi-Transparent Objects (چکیده)
3 - Space–Query-Time Tradeoff for Computing the Visibility Polygon (چکیده)
4 - Weak Visibility of Two Objects in Planar Polygonal Scenes (چکیده)
5 - Approximating Component Selection With General Costs (چکیده)
6 - Probabilistic Model Checking: A Comparison of GPMC versus PRISM (چکیده)
7 - α-Visibility (چکیده)
8 - Space/query-time tradeoff for computing the visibility polygon (چکیده)
9 - Scheduling tasks with exponential duration on unrelated parallel machines (چکیده)